A note on computing a maximal planar subgraph using PQ-trees
نویسندگان
چکیده
The problem of computing a maximal planar subgraph of a non planar graph has been deeply investigated over the last 20 years. Several attempts have been tried to solve the problem with the help of P Q-trees. The latest attempt has been reported by Jayakumar et al. 10]. In this paper we show that the algorithm presented by Jayakumar et al. is not correct. We show that it does not necessarily compute a maximal planar subgraph and we note that the same holds for a modiied version of the algorithm presented by Kant 12]. Our conclusions most likely suggest not to use P Q-trees at all for this speciic problem.
منابع مشابه
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]. In this paper, we present a new tool for representation and detection of gene clusters in multiple genomes, using PQ trees [6]: this describes the inner structure and the relations between clusters succinctly, aids i...
متن کاملA Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
In Shih & Hsu, a planarity test was introduced utilizing a data structure called PC-trees, generalized from PQ-trees. They illustrated that a PC-tree is more natural IN representing planar graphs. Their algorithm starts by constructing a depth-first-search tree and adds all back edges to a vertex one by one. A major feature in the S&H algorithm is that, at each iteration, at most two terminal n...
متن کاملGene Proximity Analysis across Whole Genomes via PQ Trees1
Permutations on strings representing gene clusters on genomes have been studied earlier and the idea of a maximal permutation pattern was introduced by Eres et al. (2003). In this paper, we present a new tool for representation and detection of gene clusters in multiple genomes, using PQ trees (Booth and Leuker, 1976): this describes the inner structure and the relations between clusters succin...
متن کاملPlanarity Algorithms via PQ-Trees
We give a linear-time planarity test that unifies and simplifies the algorithms of Shih and Hsu and Boyer and Myrvold; in our view, these algorithms are really one algorithm with different implementations. This leads to a short and direct proof of correctness without the use of Kuratowski’s theorem. Our planarity test extends to give a uniform random embedding, to count embeddings, to represent...
متن کاملGene proximity analysis across whole genomes via PQ trees.
Permutations on strings representing gene clusters on genomes have been studied earlier by Uno and Yagiura (2000), Heber and Stoye (2001), Bergeron et al. (2002), Eres et al. (2003), and Schmidt and Stoye (2004) and the idea of a maximal permutation pattern was introduced by Eres et al. (2003). In this paper, we present a new tool for representation and detection of gene clusters in multiple ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 17 شماره
صفحات -
تاریخ انتشار 1998